FIRST ORDER DYNAMIC LOGIC WITH DECIDABLE PROOFS AND WORKABLE MODEL THEORYSAIN I.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 334-340; BIBL. 7 REF.Conference Paper

THERE ARE GENERAL RULES FOR SPECIFYING SEMANTICS: OBSERVATIONS OF ABSTRACT MODEL THEORYSAIN I.1979; C. L. AND C. L.; HUN; DA. 1979; VOL. 13; PP. 195-250; BIBL. 5 P.Article

An elementary proof for some semantic characterizations of nondeterministic Floyd-Hoare logicSAIN, I.Notre Dame journal of formal logic. 1989, Vol 30, Num 4, pp 563-573, issn 0029-4527Article

Concerning some cylindric algebra versions of the downward Löwenheim-Skolem theoremSAIN, I.Notre Dame journal of formal logic. 1988, Vol 29, Num 3, pp 332-344, issn 0029-4527Article

Temporal logics need their clocksSAIN, I.Theoretical computer science. 1992, Vol 95, Num 1, pp 75-95, issn 0304-3975Article

A simple proof for the completeness of Floyd's methodSAIN, I.Theoretical computer science. 1985, Vol 35, Num 2-3, pp 345-348, issn 0304-3975Article

COMPLETENESS PROBLEMS IN VERIFICATION OF PROGRAMS AND PROGRAM SCHEMESANDREXA H; NEMETT I; SAIN I et al.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 208-218; BIBL. 14 REF.Conference Paper

A COMPLETE LOGIC FOR REASONING ABOUT PROGRAMS VIA NONSTANDARD MODEL THEORY IIANDREKA H; NEMETI I; SAIN I et al.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 3; PP. 259-278; BIBL. 26 REF.Article

A COMPLETE LOGIC FOR REASONING ABOUT PROGRAMS VIA NONSTANDARD MODEL THEORYANDREKA H; NEMETI I; SAIN I et al.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 2; PP. 193-212; BIBL. 32 REF.Article

A CHARACTERIZATION OF FLOYD-PROVABLE PROGRAMSANDREKA H; NEMETI I; SAIN I et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 162-171; BIBL. 11 REF.Conference Paper

Total correctness in nonstandard logics of programsSAIN, I; ENGELER, E.Theoretical computer science. 1987, Vol 50, Num 3, pp 285-321, issn 0304-3975Article

Weak second order characterizations of various program verification systemsMAKOWSKY, J. A; SAIN, I.Theoretical computer science. 1989, Vol 66, Num 3, pp 299-321, issn 0304-3975Article

On the strength of temporal proofsANDREKA, H; NEMETI, I; SAIN, I et al.Theoretical computer science. 1991, Vol 80, Num 2, pp 125-151, issn 0304-3975Article

Hydrogenation behaviour of Ce-based AB₅ intermetallic compoundsSAIN, R. K; JAIN, Ankur; AGARWAL, Shivani et al.Journal of alloys and compounds. 2007, Vol 440, Num 1-2, pp 84-88, issn 0925-8388, 5 p.Article